A rigorous numerical algorithm for computing the linking number of links
نویسنده
چکیده
We propose a rigorous numerical algorithm for computing the linking number of piecewise affine links given by spatially distributed data points. The key idea is to use an analytic expression for the solid angle of a tetrahedron to quickly evaluate the degree of the Gauss map. An implementation of the algorithm with INTLAB, a Matlab toolbox for reliable computing, is also provided.
منابع مشابه
Algorithms for Computing Limit distributions of Oscillating Systems with Finite Capacity
We address the batch arrival systems with finite capacity under partial batch acceptance strategy where service times or rates oscillate between two forms according to the evolution of the number of customers in the system. Applying the theory of Markov regenerative processes and resorting to Markov chain embedding, we present a new algorithm for computing limit distributions of the number cus...
متن کاملNumerical modeling of links behavior in eccentric bracings with dual vertical links
Configuration and geometry of bracing systems affect the seismic performance of structures significantly. Recently, the current authors have introduced a new configuration for eccentric bracing of structural frames that may be assumed as the combination of inverted Y-type and rotated K-type EBFs. The resulted braced frame is called EBF-DVL, consisting of two vertical links attached together by ...
متن کاملSIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD
In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...
متن کاملAsymptotic algorithm for computing the sample variance of interval data
The problem of the sample variance computation for epistemic inter-val-valued data is, in general, NP-hard. Therefore, known efficient algorithms for computing variance require strong restrictions on admissible intervals like the no-subset property or heavy limitations on the number of possible intersections between intervals. A new asymptotic algorithm for computing the upper bound of the samp...
متن کاملNumerical solution of fuzzy differential equations under generalized differentiability by fuzzy neural network
In this paper, we interpret a fuzzy differential equation by using the strongly generalized differentiability concept. Utilizing the Generalized characterization Theorem. Then a novel hybrid method based on learning algorithm of fuzzy neural network for the solution of differential equation with fuzzy initial value is presented. Here neural network is considered as a part of large eld called ne...
متن کامل